Improving Robustness and Parallel Scalability of Newton Method Through Nonlinear Preconditioning⋆
نویسندگان
چکیده
Inexact Newton method with backtracking is one of the most popular techniques for solving large sparse nonlinear systems of equations. The method is easy to implement, and converges well for many practical problems. However, the method is not robust. More precisely speaking, the convergence may stagnate for no obvious reason. In this paper, we extend the recent work of Tuminaro, Walker and Shadid [2002] on detecting the stagnation of Newton method using the angle between the Newton direction and the steepest descent direction. We also study a nonlinear additive Schwarz preconditioned inexact Newton method, and show that it is numerically more robust. Our discussion will be based on parallel numerical experiments on solving some high Reynolds numbers steady-state incompressible Navier-Stokes equations in the velocity-pressure formulation.
منابع مشابه
Nonlinear Overlapping Domain Decomposition Methods
We discuss some overlapping domain decomposition algorithms for solving sparse nonlinear system of equations arising from the discretization of partial differential equations. All algorithms are derived using the three basic algorithms: Newton for local or global nonlinear systems, Krylov for the linear Jacobian system inside Newton, and Schwarz for linear and/or nonlinear preconditioning. The ...
متن کاملParallel Performance of Some Two-Level ASPIN Algorithms
In this paper we study the parallel performance of some nonlinear additive Schwarz preconditioned inexact Newton methods for solving large sparse system of nonlinear equations arising from the discretization of partial differential equations. The main idea of nonlinear preconditioning is to replace an ill-conditioned nonlinear system by an equivalent nonlinear system that has more balanced nonl...
متن کاملSeveral Parallel Algorithms for Solving Nonlinear Systems with Symmetric and Positive Definite Jacobians
In this work we describe two sequential algorithms and their parallel counterparts for solving nonlinear systems, when the Jacobian matrix is symmetric and positive definite. This case appears frequently in unconstrained optimization problems. Both algorithms are based on Newton’s method. The first solves the inner iteration with Cholesky decomposition while the second is based on the inexact N...
متن کاملAn Efficient and Effective Nonlinear Solver in a Parallel Software for Large Scale Petroleum Reservoir Simulation
We study a parallel Newton-Krylov-Schwarz (NKS) based algorithm for solving large sparse systems resulting from a fully implicit discretization of partial differential equations arising from petroleum reservoir simulations. Our NKS algorithm is designed by combining an inexact Newton method with a rank-2 updated quasi-Newton method. In order to improve the computational efficiency, both DDM and...
متن کاملA Parallel Nonlinear Additive Schwarz Preconditioned Inexact Newton Algorithm for Incompressible Navier-Stokes Equations ?
A nonlinear additive Schwarz preconditioned inexact Newton method (ASPIN) was introduced recently for solving large sparse highly nonlinear system of equations obtained from the discretization of nonlinear partial differential equations. In this paper, we discuss some extensions of ASPIN for solving the steady-state incompressible Navier-Stokes equations with high Reynolds numbers in the veloci...
متن کامل